Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling

Skylines with partial order preference semanticsoften result in huge answer sets and what is worse,they cannot be computed efficiently. In this paperwe will explore the evaluation of so-called re-stricted skyline queries with partial order prefer-ences under the paradigm of weak Pareto domi-nance. Weak Pareto dominance removes all objectsfrom skylines, which are dominated by other ob-jects in some query predicates, but in turn do notdominate these objects in any predicate. We willargue that this paradigm yields intuitive results,prove that it leads to lean sizes of the restrictedskyline and show how it opens up the use of effi-cient algorithms for evaluation adopting the itera-tion of ranked result lists for each query predicate.